package com.maltys.dp;

/**
 * @author malty
 * @link <a href="https://leetcode.cn/problems/unique-binary-search-trees/description/">不同的二叉搜索树</a>
 */
public class DifferentTree {
    public static void main(String[] args) {
        DifferentTree differentTree = new DifferentTree();
        int numTrees = differentTree.numTrees(6);
        System.out.println(numTrees);
    }

    public int numTrees(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                dp[i] += dp[j - 1] * dp[i - j];
            }
        }
        return dp[n];
    }
}
